Iterative decoding of linear codes by a modulo-2 linear program
نویسندگان
چکیده
منابع مشابه
Decoding Linear Codes
We mention four recent results, none of which has appeared yet. They come from different sources. The purpose of these notes is to present them in a short way. Two results concern the generalization of the Roos-bound from cyclic codes to more general linear codes. Two others concern the use of majority coset decoding to the decoding of cyclic codes. ∗Supported by NWO, The Netherlands. Prepared ...
متن کاملLinear Codes Through Latin Squares Modulo n
It is known that t mutually orthogonal latin squares of order n generate a b t 2c-error correcting code with n codewords. In this paper we consider latin squares of order n made up of elements taken from Zn. In this situation we consider when this code is linear. We present neccessary and sufficient conditions on the latin squares and obtain a method of constructing a maximal family of mutually...
متن کاملA Soft Decoding of Linear Block Codes by Genetic Algorithms
Abstract— In this paper, we present a hard-decision decoding technique based on Genetic Algorithms (HDGA), which is applicable to the general case where the only known structure is given by the generating matrix G. We also present a new soft-decision decoding based on HDGA and the Chase algorithm (SDGA). The simulations, applied on some binary Linear Block Codes, show that the genetic decoder h...
متن کاملPermutation decoding of Z 2 Z 4 - linear codes
An alternative permutation decoding method is described which can be used for any binary systematic encoding scheme, regardless whether the code is linear or not. Thus, the method can be applied to some important codes such as Z2Z4-linear codes, which are binary and, in general, nonlinear codes in the usual sense. For this, it is proved that these codes allow a systematic encoding scheme. As pa...
متن کاملOptimizing linear maps modulo 2
This paper introduces and analyzes an algorithm to compile a series of exclusive-or operations. The compiled series is quite efficient, almost always beating the so-called “Four Russians” approach, and uses no temporary storage beyond its outputs. The algorithm is reasonably fast and surprisingly simple.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1972
ISSN: 0012-365X
DOI: 10.1016/0012-365x(72)90033-7